Convex optimization of output link scheduling and active queue management in QoS constrained packet switches

We present two novel algorithms at the ingress and egress of packet switches with QoS provisioning and fairness constraints. We first provide a suite of generalized weighted fair queuing formulations for output link scheduling, where the weights can be dynamically optimized under QoS constraints using the tool of geometric programming. We then provide a suite of active queue management formulations for flexible ingress buffer management, using the tool of semefinite programming. Both sets of formulations are nonlinear, and are special cases of convex optimization problems, which can be solved globally and as efficiently as linear problems.